Steepest descent and differential equations

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Doubly Degenerate Diiusion Equations as Steepest Descent

For p 2 (1; 1) and n > 0 we consider the scalar doubly degenerate diiusion equation @ t s ? div(jrs n j p?2 rs n) = 0 in (0; 1) (1) with no{{ux boundary conditions. We argue that this evolution problem can be understood as steepest descent of the convex functional sign(m ? 1) Z s m ; provided m := n + p ? 2 p ? 1 > 0 ; (2) w. r. t. the Wasserstein metric of order p on the space of probability d...

متن کامل

Steepest Descent

The steepest descent method has a rich history and is one of the simplest and best known methods for minimizing a function. While the method is not commonly used in practice due to its slow convergence rate, understanding the convergence properties of this method can lead to a better understanding of many of the more sophisticated optimization methods. Here, we give a short introduction and dis...

متن کامل

Residual norm steepest descent based iterative algorithms for Sylvester tensor equations

Consider the following consistent Sylvester tensor equation[mathscr{X}times_1 A +mathscr{X}times_2 B+mathscr{X}times_3 C=mathscr{D},]where the matrices $A,B, C$ and the tensor $mathscr{D}$ are given and $mathscr{X}$ is the unknown tensor. The current paper concerns with examining a simple and neat framework for accelerating the speed of convergence of the gradient-based iterative algorithm and ...

متن کامل

Approximate Steepest Coordinate Descent

We propose a new selection rule for the coordinate selection in coordinate descent methods for huge-scale optimization. The efficiency of this novel scheme is provably better than the efficiency of uniformly random selection, and can reach the efficiency of steepest coordinate descent (SCD), enabling an acceleration of a factor of up to n, the number of coordinates. In many practical applicatio...

متن کامل

Mann-type Steepest-descent and Modified Hybrid Steepest-descent Methods for Variational Inequalities in Banach Spaces

1Department of Mathematics, Shanghai Normal University, Shanghai; and Scientific Computing Key Laboratory of Shanghai Universities, Shanghai, China 2Department of Mathematics & Statistics, College of Science, King Fahd University of Petroleum & Minerals, Dhahran, Saudi Arabia; and Department of Mathematics, Aligarh Muslim University, Aligarh, India 3Department of Applied Mathematics, National S...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Mathematical Society of Japan

سال: 1985

ISSN: 0025-5645

DOI: 10.2969/jmsj/03720187